Formal Design of an Abstract Machine for Constraint Logic Programming
نویسنده
چکیده
By studying properties of CLP over an unspecified constraint domain X one obtains general results applicable to all instances of CLP(X ). The purpose of this paper is to study a general implementation scheme for CLP(X ) by designing a generic extension WAM(X ) of the WAM and a corresponding generic compilation scheme of CLP(X ) programs to WAM(X ) code which is based on Börger and Rosenzweig’s WAM specification and correctness proof. Thus, using the evolving algebra specification method, we obtain not only a formal description of our WAM(X ) scheme, but also a mathematical correctness proof for the design.∗ Keyword Codes: D.1.6, F.3.1
منابع مشابه
Correctness Proof For the WAM with Types
We provide a mathematical speciication of an extension of Warren's Abstract Machine for executing Prolog to type-constraint logic programming and prove its correctness. In this paper, we keep the notion of types and dynamic type constraints rather abstract to allow applications to diierent constraint formalisms like Prolog III or CLP(R). This generality permits us to introduce modular extension...
متن کاملA Constraint Logic Programming Systemwith Parametric Domain
Current implementations of constraint logic programming languages (like CLP(<), CHIP or RISC-CLP(Real) support constraint solving over a certain xed domain. In this paper a system is presented which gives the possibility to instantiate a constraint logic programming language with an arbitrary constraint domain. The interface between the system and such a constraint domain is given and the exten...
متن کاملDesign and Implementation of Practical Constraint Logic Programming Systems
The Constraint Logic Programming (CLP) scheme, developed by Jaffar and Lassez, defines a class of rule–based constraint programming languages. These generalize traditional logic programming languages (like Prolog) by replacing the basic operational step, unification, with constraint solving. While CLP languages have a tremendous advantage in terms of expressive power, they must be shown to be a...
متن کاملJ LOGIC PROGRAMMING to appear Constraint Logic Programming A Survey
Machine This section discusses some major issues in the design of an abstract machine for the execution of CLP programs The primary focus here will be on the design of the instruction set with emphasis on the interaction between their use and information obtained from a potential program analyzer Some elements of the runtime structure will also be mentioned In general the essential features of ...
متن کاملSome Methodological Issues in the Design of CIAO, a Generic, Parallel Concurrent Constraint Logic Programming System
A b s t r a c t . We informally discuss several issues related to the parallel execution of logic programming systems and concurrent logic programming systems, and their generalization to constraint programming. We propose a new view of these systems, based on a particular definition of parallelism. We argüe that, under this view, a large number of the actual systems and models can be explained...
متن کامل